Distributed on-line dynamic task assignment for multi-robot patrolling
نویسندگان
چکیده
منابع مشابه
Distributed on-line dynamic task assignment for multi-robot patrolling
Abstract Multi-Robot Patrolling is a key feature for various applications related to surveillance and security, and it has been studied from several different perspectives, ranging from techniques that devise optimal off-line strategies to implemented systems. However, still few approaches consider on-line decision techniques that can cope with uncertainty and non-determinism in robot behaviors...
متن کاملDistributed Algorithm Design for Multi-robot Generalized Task Assignment
We present a provably-good distributed algorithm for generalized task assignment problem in the context of multirobot system (MR-GAP), where a group of robots need to cooperate to complete a group of tasks. In MR-GAP, each robot has its own resource budget constraint, and needs to consume a certain amount of resource to obtain a payoff for each task. The overall objective is to find a maximum p...
متن کاملDistributed Algorithm Design for Constrained Multi-robot Task Assignment
The task assignment problem is one of the fundamental combinatorial optimization problems. It has been extensively studied in operation research, management science, computer science and robotics. Task assignment problems arise in various applications of multi-robot systems (MRS), such as environmental monitoring, disaster response, extraterrestrial exploration, sensing data collection and coll...
متن کاملDistributed Multi-Robot Area Patrolling in Adversarial Environments
Multi-robot patrolling is the problem of repeatedly visiting a group of regions of interest in an environment with a group of robots to prevent intrusion. Early works proposed deterministic patrolling algorithms which could be learned by an adversary observing them over time. More recent works provide non-deterministic patrolling schemes, but these are limited to perimeter patrolling and requir...
متن کاملDynamic Task Assignment in Robot Swarms
A large group of robots will often be partitioned into subgroups, each subgroup performing a different task. This paper presents four distributed algorithms for assigning swarms of homogenous robots to subgroups to meet a specified global task distribution. Algorithm Random-Choice selects tasks randomly, but runs in constant time. Algorithm Extreme-Comm compiles a complete inventory of all the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Autonomous Robots
سال: 2016
ISSN: 0929-5593,1573-7527
DOI: 10.1007/s10514-016-9579-8